Searchable Symmetric Encryption with Forward Search Privacy

Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries practice. Although SSE is powerful and feature-rich, it always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement any newly designed schemes. However, subsequent search operations can still leak significant amount of information. To further strengthen security, we extend definition propose notion “forward privacy”. Intuitively, requires over added documents do not about past queries. The enhanced security poses new challenges to design SSE. We address developing hidden pointer technique (HPT) scheme called Khons, satisfies our (with original notion) also efficient. implemented Khons experiment results on large dataset (wikipedia) show more efficient than existing schemes with privacy.